Consecutive interval query and dynamic programming on intervals
نویسندگان
چکیده
منابع مشابه
Consecutive Interval Query and Dynamic Programming on Intervals
Given a set of n points (nodes) on a line and a set of m weighted intervals defined on the nodes, we consider a particular dynamic programming (DP) problem on these intervals. If the weight function of the DP has convex or concave property, we can solve this DP problem efficiently by using matrix searching in Monge matrices, together with a new query data structure, which we call the consecutiv...
متن کاملSubtree Reconstruction, Query Node Intervals and Tree Pattern Query Evaluation
Since the extensible markup language XML emerged as a new standard for information representation and exchange on the Internet, the problem of storing, indexing, and querying XML documents has been among the major issues of database research. In this paper, we study the tree pattern matching and discuss a new algorithm for processing ordered tree pattern queries, by which not only ancestor/desc...
متن کاملThe Intervals and Absences of Temporal Query
In our burgeoning world of ubiquitous sensors and affordable data storage, records of timestamped events are being produced across nearly every domain of personal and professional computing. This data ranges from government-funded medical databases, to the meticulously tabulated comings and goings of obsessive self-trackers. Across all domains, however, is the need to search these records for m...
متن کاملHev Fuel Optimization Using Interval Back Propagation Based Dynamic Programming
To my Parents Whose guidance, care, love, and support has proven extremely valuable to me ACKNOWLEDGEMENTS First and foremost I would like to thank my advisor, Dr. Nader Sadegh, for giving me the opportunity to carry out this research. I feel privileged to work alongside him for the last two years. He has been a guiding light, supporting me at all times and giving me the right advice. His words...
متن کاملProgramming with Intervals
Intervals are a new, higher-level primitive for parallel programming with which programmers directly construct the program schedule. Programs using intervals can be statically analyzed to ensure that they do not deadlock or contain data races. In this paper, we demonstrate the flexibility of intervals by showing how to use them to emulate common parallel control-flow constructs like barriers an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00021-3